Yet Another New Optimum-time Synchronization Algorithm for Two-dimensional Arrays

نویسندگان

  • Hiroshi Umeo
  • Hiroki Uchino
چکیده

The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we give a new optimum-time algorithm for synchronizing twodimensional cellular automata. Its state-efficient implementation is also given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to synchronize square arrays in optimum-time - A new square synchronization algorithm

The firing squad synchronization problem (FSSP, for short) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed for oneand two-dimensional cellular automata. In the present paper, we propose a new optimum-time FSSP algorithm for two-dimensional square cellular automata. The algorithm can synchronize any ...

متن کامل

How to Synchronize Large-Scale Ultra-Fine-Grained Processors in Optimum-Time

Abstract—We introduce a new class of FSSP (firing squad synchronization problem) algorithms based on recursive-halving and construct a survey on recent developments in FSSP algorithms for one-dimensional cellular arrays. We present herein a comparison of the quantitative aspects of the optimum-time FSSP algorithms developed so far. Several state-efficient new implementations and new insights in...

متن کامل

A Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata

The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a simple recursive-halving based optimum-time synchronization algorithm that can synchronize any rectangle ...

متن کامل

State-efficient Time-optimum Synchronization Protocols for Two-dimensional Arrays -A Survey-

The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we give a survey on recent developments in firing squad synchronization algorithms for synchronizing large-scale two-dimensional cellular automata. Several new algorithms and their stateefficient implementatio...

متن کامل

Two-Dimensional Cellular Automata Synchronizers

We study a firing squad synchronization problem that gives a finite-state protocol for synchronizing large-scale cellular automata. In this paper, we give a survey on recent developments in designing optimumand non-optimum-time synchronization algorithms and present their state-efficient implementations for two-dimensional cellular arrays. Several simple, state-efficient mapping schemes are pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006